FSTTCS 2006 (foundations of software technology and theoretical computer science)Arun-Kumar, S; Garg, Naveen.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-49994-6, 1Vol, XIII-430 p, isbn 3-540-49994-6Conference Proceedings

Approximation algorithms for 2-stage stochastic optimization problemsSWAMY, Chaitanya; SHMOYS, David B.Lecture notes in computer science. 2006, pp 5-19, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 15 p.Conference Paper

Monitoring of real-time propertiesBAUER, Andreas; LEUCKER, Martin; SCHALLHART, Christian et al.Lecture notes in computer science. 2006, pp 260-272, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 13 p.Conference Paper

Hennessy-plotkin-brookes revisitedPLOTKIN, Gordon.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-49994-6, 1Vol, p. 4Conference Paper

A proof system for the linear time μ-calculusDAX, Christian; HOFMANN, Martin; LANGE, Martin et al.Lecture notes in computer science. 2006, pp 273-284, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Expressivity properties of boolean BI through relational modelsGALMICHE, Didier; LARCHEY-WENDLING, Dominique.Lecture notes in computer science. 2006, pp 357-368, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Fast edge colorings with fixed number of colors to minimize imbalanceCALINESCU, Gruia; PELSMAJER, Michael J.Lecture notes in computer science. 2006, pp 117-128, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

On reduction criteria for probabilistic reward modelsGROBER, Marcus; NORMAN, Gethin; BAIER, Christel et al.Lecture notes in computer science. 2006, pp 309-320, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Rational behaviour and strategy construction in infinite multiplayer gamesUMMELS, Michael.Lecture notes in computer science. 2006, pp 212-223, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Almost optimal strategies in one clock priced timed gamesBOUYER, Patricia; LARSEN, Kim G; MARKEY, Nicolas et al.Lecture notes in computer science. 2006, pp 345-356, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Branching pushdown tree automataALUR, Rajeev; CHAUDHURI, Swarat.Lecture notes in computer science. 2006, pp 393-404, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Context-sensitive dependency PairsALARCON, Beatriz; GUTIERREZ, Raul; LUCAS, Salvador et al.Lecture notes in computer science. 2006, pp 297-308, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Distributed synthesis for well-connected architecturesGASTIN, Paul; SZNAJDER, Nathalie; ZEITOUN, Marc et al.Lecture notes in computer science. 2006, pp 321-332, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Game semantics for higher-order concurrencyLAIRD, J.Lecture notes in computer science. 2006, pp 417-428, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

On obtaining pseudorandomness from error-correcting codesKALYANARAMAN, Shankar; UMANS, Christopher.Lecture notes in computer science. 2006, pp 105-116, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Shared-variable concurrency : A proposaiBOUDOL, Gérard.Lecture notes in computer science. 2006, pp 1-3, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 3 p.Conference Paper

Multi-stack boundary labeling problemsBEKOS, Michael A; KAUFMANN, Michael; POTIKA, Katerina et al.Lecture notes in computer science. 2006, pp 81-92, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

On continuous timed automata with input-determined guardsCHEVALIER, Fabrice; D'SOUZA, Deepak; PRABHAKAR, Pavithra et al.Lecture notes in computer science. 2006, pp 369-380, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Some results on average-case hardness within the polynomial hierarchyPAVAN, A; SANTHANAM, Rahul; VINODCHANDRAN, N. V et al.Lecture notes in computer science. 2006, pp 188-199, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

The meaning of ordered SOSMOHAMMADREZA MOUSAVI; PHILLIPS, Iain; RENIERS, Michel A et al.Lecture notes in computer science. 2006, pp 333-344, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Tree automata make ordinal theory easyCACHAT, Thierry.Lecture notes in computer science. 2006, pp 285-296, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Computationally sound symbolic secrecy in the presence of hash functionsCORTIER, Véronique; KREMER, Steve; KUSTERS, Ralf et al.Lecture notes in computer science. 2006, pp 176-187, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

One-input-face MPCVP is hard for L, but in LogDCFLCHAKRABORTY, Tanmoy; DATTA, Samir.Lecture notes in computer science. 2006, pp 57-68, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Safely freezing LTLLAZIC, Ranko.Lecture notes in computer science. 2006, pp 381-392, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

The anatomy of innocence revisitedHARMER, Russ; LAURENT, Olivier.Lecture notes in computer science. 2006, pp 224-235, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper